Kernel method and linear recurrence system

Solving a System of Linear Equations by Homotopy Analysis Method

‎In this paper‎, ‎an efficient algorithm for solving a system of linear‎ ‎equations based on the homotopy analysis method is presented‎. ‎The‎ ‎proposed method is compared with the classical Jacobi iterative‎ ‎method‎, ‎and the convergence analysis is discussed‎. ‎Finally‎, ‎two‎ ‎numerical examples are presented to show the effectiveness of the‎ ‎proposed method.‎

A method for solving fully fuzzy linear system

In this paper, a numerical method for nding minimal solution of a mn fullyfuzzy linear system of the form Ax = b based on pseudo inverse calculation,is given when the central matrix of coecients is row full rank or column fullrank, and where A~ is a non-negative fuzzy mn matrix, the unknown vectorx is a vector consisting of n non-negative fuzzy numbers and the constant b isa vector consisting o...

A New Method for Solving Fuzzy Linear System

An Improved Recurrence Method for Simple Continuous Linear Programs

⎯In this paper we discuss a special class of continuous linear programs called simple continuous linear programs (SP). In our recent paper [Wen et al. (2009)], we proposed a recurrence algorithm for solving (SP). The major computational works in the proposed algorithm are finding the global minimal values of the given continuous functions on 2 intervals. However, when n becomes large, it could ...

Reproducing Kernel Method for Solving Systems of Linear Equations

Abstract A new method for finding the exact solutions of systems of linear equations is presented. Advantage of this method is the simplicity of the procedure. There are no additional constraint conditions. The method can avoid evaluation of determinants and matrix computation, and this reduces the amount of computation. Also, the method is valid when the coefficient matrix of the linear system...